Isometric Words Based on Swap and Mismatch Distance

An edit distance is a metric between words that quantifies how two differ by counting the number of operations needed to transform one word into other one. A f said isometric with respect an if, for any pair f-free u and v, there exists transformation minimal length from v via related such all intermediate are also f-free. The adjective “isometric” comes fact that, if Hamming considered (i.e., only mismatches), then define some subgraphs hypercubes. We consider case swap mismatch. compare it mismatch prove properties particular features their overlaps.